Retracted: The HSABA for Emergency Location-Routing Problem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Popmusic for the World Location Routing Problem

ABSTRACT. POPMUSIC — Partial optimization metaheuristic under special intensification conditions — is a template for tackling large problem instances. This template has been shown to be very efficient for various combinatorial problems like p-median, sum of squares clustering, vehicle routing and map labeling. In terms of algorithmic complexity, one of the most complex part of POPMUSIC template...

متن کامل

The Latency Location-Routing Problem

This paper introduces the Latency Location-Routing Problem (LLRP) whose goal is to minimize waiting time of recipients by optimally determining both the locations of depots and the routes of vehicles. The LLRP is customer oriented by pursuing minimization of the latency instead of minimization of the length of routes. One of the main applications of this problem is the distribution of supplies ...

متن کامل

Designing Incomplete Hub Location-routing Network in Urban Transportation Problem

In this paper, a comprehensive model for hub location-routing problem is proposed which no network structure other than connectivity is imposed on backbone (i.e. network between hub nodes) and tributary networks (i.e. networks which connect non-hub nodes to hub nodes). This model is applied in public transportation, telecommunication and banking networks. In this model locating and routing is c...

متن کامل

Heuristics for a hub location-routing problem

We investigate a variant of the many-to-many hub location-routing problem which consists in partitioning the set of nodes of a graph into routes containing exactly one hub each, and determining an extra route interconnecting all hubs. A variable neighborhood descent with neighborhood structures based on remove/add, swap and exchange moves nested with routing and location operations is used as a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematical Problems in Engineering

سال: 2021

ISSN: 1563-5147,1024-123X

DOI: 10.1155/2021/8989106